Computing Minimal Generators of Ideals of Elliptic Curves

نویسنده

  • L. CHIANTINI
چکیده

In this paper results about the Hilbert function and about the number of minimal generators stated in (Orecchia) for disjoint unions of rational smooth curves are generalized to disjoint unions of distinct smooth non special curves. Hence, the maximal rank and the minimal generation of such curves are studied. In particular, we consider elliptic curves and we describe a method to compute their Hilbert functions in any dimension and for every choice of the degrees. Applications to the study of elliptic curves on threefolds are shown.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complete characterization of the Mordell-Weil group of some families of elliptic curves

 The Mordell-Weil theorem states that the group of rational points‎ ‎on an elliptic curve over the rational numbers is a finitely‎ ‎generated abelian group‎. ‎In our previous paper, H‎. ‎Daghigh‎, ‎and S‎. ‎Didari‎, On the elliptic curves of the form $ y^2=x^3-3px$‎, ‎‎Bull‎. ‎Iranian Math‎. ‎Soc‎.‎‎ 40 (2014)‎, no‎. ‎5‎, ‎1119--1133‎.‎, ‎using Selmer groups‎, ‎we have shown that for a prime $p...

متن کامل

Efficient elliptic curve cryptosystems

Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...

متن کامل

Minimally Generating Ideals of Rational Parametric Curves in Polynomial Time

The problem of computing a minimal set of generators for the ideal of a rational parametric projective curve has been tackled by elimination theory and can be solved by the computation of Gröbner bases (see, for example Kalkbrener, 1991; Licciardi and Mora, 1994; Gao and Chou, 1992; Fix et al., 1996, and references therein). These methods have been implemented in CoCoA 3.6 (Capani et al., 1995)...

متن کامل

eo m / 9 50 30 24 v 1 2 9 M ar 1 99 5 Degrees of Generators of Ideals Defining Subschemes of Projective Space

In this paper, we are interested in giving an upper bound for the degrees of the generators for an ideal defining a curve in projective space, and in investigating the properties of curves for which this bound is realized. While our bound works for subschemes of any dimension in any projective space, our characterizations for when the bound is realized only work for curves in P. Using the known...

متن کامل

An Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves

‎In a (t,n)-threshold secret sharing scheme‎, ‎a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together‎, ‎but no group of fewer than t participants can do‎. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao‎, ‎and the intractability of the elliptic curve discrete logar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001